Field Complete Coverage Path Planning Based on Improved Genetic Algorithm for Transplanting Robot
نویسندگان
چکیده
The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robots, and has great significance for improving efficiency quality tillage, fertilization, harvesting, other robot operations, as well reducing operation energy consumption. traditional boustrophedon- or heuristic-search-algorithm-based CCPP methods, when coping with irregular boundaries, obstacles, complex environments, still face many problems challenges, such large repeated work areas, multiple turns U-turns, low efficiency, prone to local optimum. In order solve above problems, an improved-genetic-algorithm-based method was proposed this paper, innovatively extends genetic algorithm’s chromosomes single-point mutation into chromosome pairs multi-point mutation, multi-objective equilibrium fitness function. simulation experimental results on simple regular fields showed that achieved comparable performance boustrophedon-based method. However, fields, reduces 38.54% area 35.00% number can save 7.82% consumption average. This proved strong adaptive capacity environment, practical application value machinery
منابع مشابه
Robot Path Planning Method Based on Improved Genetic Algorithm
This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملMobile Robot Path Planning Based on Improved Q Learning Algorithm
For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...
متن کاملMobile Robot Dynamic Path Planning Based on Genetic Algorithm
In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...
متن کاملAn Improved Robot Path Planning Algorithm
Robot path planning is a NP problem; traditional optimization methods are not very effective to solve it. Traditional genetic algorithm trapped into the local minimum easily. Therefore, based on a simple genetic algorithm and combine the base ideology of orthogonal design method then applied it to the population initialization, using the intergenerational elite mechanism, as well as the introdu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machines
سال: 2023
ISSN: ['2075-1702']
DOI: https://doi.org/10.3390/machines11060659